Symbolic-Numeric Sparse Polynomial Interpolation in Chebyshev Basis and Trigonometric Interpolation
نویسندگان
چکیده
We consider the problem of efficiently interpolating an “approximate” black-box polynomial p(x) that is sparse when represented in the Chebyshev basis. Our computations will be in a traditional floating-point environment, and their numerical sensitivity will be investigated. We also consider the related problem of interpolating a sparse linear combination of “approximate” trigonometric functions. The costs of all our algorithms will be sensitive to the sparsity of the output.
منابع مشابه
Sparse polynomial interpolation in Chebyshev bases
We study the problem of reconstructing a sparse polynomial in a basis of Chebyshev polynomials (Chebyshev basis in short) from given samples on a Chebyshev grid of [−1, 1]. A polynomial is called M -sparse in a Chebyshev basis, if it can be represented by a linear combination of M Chebyshev polynomials. For a polynomial with known and unknown Chebyshev sparsity, respectively, we present efficie...
متن کاملNEW ALGORITHM , S FOR POLYNOMIAL AND TRIGONOMETRIC INTERPOLATION ON PARALLEL COMPUTERS by Ilan Bar -
An interpolation polynomial of order N is constructed from p indepen dent subpolynomials of order n '" Nip. Each such subpolynomial is found independently and in parallel. Moreover, evaluation of the polynomial at any given point is done independently and in parallel, except for a final step of summation of p elements. Hence, the algorithm has almost no commu ,:.. nication overhead and can be...
متن کاملTENSION QUARTIC TRIGONOMETRIC BÉZIER CURVES PRESERVING INTERPOLATION CURVES SHAPE
In this paper simple quartic trigonometric polynomial blending functions, with a tensionparameter, are presented. These type of functions are useful for constructing trigonometricB´ezier curves and surfaces, they can be applied to construct continuous shape preservinginterpolation spline curves with shape parameters. To better visualize objects and graphics atension parameter is included. In th...
متن کامل1014 - 65 - 636
Wen-shin Lee* ([email protected]), Mathematics and Computer Science Department, University of Antwerp, Middelheimlaan 1, 2020 Antwerpen, Belgium. Symbolic-Numeric Sparse Polynomial Interpolation. We consider the problem of sparse interpolation of a multivariate polynomial that is given as a black box in floating-point arithmetic. When the target polynomial is sparse, there are efficient inte...
متن کاملOn Chebyshev interpolation of analytic functions
This paper reviews the notion of interpolation of a smooth function by means of Chebyshev polynomials, and the well-known associated results of spectral accuracy when the function is analytic. The rate of decay of the error is proportional to ρ−N , where ρ is a bound on the elliptical radius of the ellipse in which the function has a holomorphic extension. An additional theorem is provided to c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004